Bipartite Graph Tiling
نویسنده
چکیده
For each s ≥ 2, there exists m0 such that the following holds for all m ≥ m0: Let G be a bipartite graph with n = ms vertices in each partition set. If m is odd and minimum degree δ(G) ≥ n+3s 2 − 2, then G contains m vertex-disjoint copies of Ks,s. If m is even, the same holds under the weaker condition δ(G) ≥ n/2+ s− 1. This is sharp and much stronger than a conjecture of Wang [25] (for large n).
منابع مشابه
Minimum degree threshold for bipartite graph tiling
We answer a question of Zhao [SIAM J. Disc. Math. 23 vol.2, (2009), 888-900] that determines the minimum degree threshold for a bipartite graph G to contain an H-factor (a perfect tiling of G with H) for any bipartite graph H. We also show that this threshold is best possible up to a constant depending only on H. This result can be viewed as an analog to Kuhn and Osthus' result [Combinatorica 2...
متن کاملMinimum degree thresholds for bipartite graph tiling
Given a bipartite graph H and a positive integer n such that v(H) divides 2n, we define the minimum degree threshold for bipartite H-tiling, δ2(n,H), as the smallest integer k such that every bipartite graph G with n vertices in each partition and minimum degree δ(G) ≥ k contains a spanning subgraph consisting of vertex-disjoint copies of H. Zhao, Hladký-Schacht, Czygrinow-DeBiasio determined δ...
متن کاملRhombellanic Crystals and Quasicrystals
Design of some crystal and quasicrystal networks, based on rhombellane tiling,is presented. [1,1,1]Propellane,is a synthesized organic molecule; its hydrogenated form, the bicyclo[1.1.1]pentane,may be represented by the complete bipartite graph K2,3 which is the smallest rhombellane. Topology of translational and radial structures involving rhombellanes is described in terms of vertex symbol, c...
متن کاملA Note on Bipartite Graph Tiling
Bipartite graph tiling was studied by Zhao [7] who gave the best possible minimum degree conditions for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of Ks,s. Let s < t be fixed positive integers. Hladký and Schacht [3] gave minimum degree conditions for a balanced bipartite graph on 2m(s + t) vertices to contain m vertex disjoint copies of Ks,t. Their results w...
متن کاملGroups whose Bipartite Divisor Graph for Character Degrees Has Five Vertices
Let $G$ be a finite group and $cd^*(G)$ be the set of nonlinear irreducible character degrees of $G$. Suppose that $rho(G)$ denotes the set of primes dividing some element of $cd^*(G)$. The bipartite divisor graph for the set of character degrees which is denoted by $B(G)$, is a bipartite graph whose vertices are the disjoint union of $rho(G)$ and $cd^*(G)$, and a vertex $p in rho(G)$ is conne...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 23 شماره
صفحات -
تاریخ انتشار 2009